Modelling Argument Accrual in Possibilistic Defeasible Logic Programming

نویسندگان

  • Mauro Javier Gómez Lucero
  • Carlos Iván Chesñevar
  • Guillermo Ricardo Simari
چکیده

Argumentation frameworks have proven to be a successful approach to formalizing commonsense reasoning. Recently, some argumentation frameworks have been extended to deal with possibilistic uncertainty, notably Possibilistic Defeasible Logic Programming (P-DeLP). At the same time, modelling argument accrual has gained attention from the argumentation community. Even though some preliminary formalizations have been advanced, they do not take into account possibilistic uncertainty when accruing arguments. In this paper we present a novel approach to model argument accrual in the context of P-DeLP in a constructive way.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical v...

متن کامل

Expansion Operators for Modelling Agent Reasoning in Possibilistic Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. When modelling i...

متن کامل

On Warranted Inference in Possibilistic Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical v...

متن کامل

A logic programming framework for possibilistic argumentation: Formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable...

متن کامل

On the Accrual of Arguments in Defeasible Logic Programming

Recently, the notion of accrual of arguments has received some attention from the argumentation community. Three principles for argument accrual have been identified as necessary to hold in argumentation frameworks. In this paper we propose an approach to model the accrual of arguments in the context of Defeasible Logic Programming, a logic programming approach to argumentationwhich has proven ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009